Deinterlacing apparatus and method thereof

ABSTRACT

The present invention relates to an interpolation technology, in particular to a deinterlacing apparatus and a method thereof which is capable of improving definition of a picture by detecting an edge direction comprised in perimeter pixel values with inputs of a pixel value of field data in a field region to be interpolated and intra-field perimeter pixel values, detecting a direction indicating a minimum region matching error in accordance with the detected direction, yielding an intra-field interpolation value in accordance with the detected edge direction and performing an interpolation, and reducing manufacture cost of a circuit by simplifying the circuit.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to an interpolation technology adapted to a picture motion, in particular to a deinterlacing apparatus and a method thereof which is capable of improving definition of a picture by performing edge direction detection and pixel interpolation.

[0003] 2. Description of the Prior Art

[0004] In the conventional image processing method, a deinterlacing method is a method converting an interlaced scanning type image signal into a progressive scanning type image signal. It will now be described with reference to accompanying FIG. 1 and 2A˜2C.

[0005]FIG. 1 illustrates a picture in accordance with the general interlacing method.

[0006] As depicted in FIG. 1, in the interlaced scanning type image data, a picture of one frame is implemented with an odd field and an even field, namely, two fields.

[0007] However, according to a type of a display apparatus, a picture is implemented by processing the interlaced scanning type image signal as a progressive scanning type image signal used in a computer monitor etc. without processing it as the interlaced scanning type image signal.

[0008] Herein, in order to process the interlaced scanning type image signal on a display apparatus for processing the progressive scanning type image signal, an additional system for converting the interlaced scanning type image signal into the progressive scanning type image signal has to be installed inside of the display apparatus.

[0009] As depicted in FIG. 2A˜2C, a converting method for converting the interlaced scanning type image signal into the progressive scanning type image signal can be implemented many ways.

[0010]FIG. 2A illustrates a line repetition in accordance with the conventional technology.

[0011] As depicted in FIG. 2A, the line repetition implements one frame by repeating line information of the present field.

[0012]FIG. 2B illustrates an intra-field interpolation without motion-compensation in accordance with the conventional technology.

[0013] As depicted in FIG. 2B, the intra-field interpolation without motion-compensation implements one frame by inserting a former field line between the present field line.

[0014]FIG. 2C illustrates an intra-field interpolation in accordance with the conventional technology.

[0015] As depicted in FIG. 2C, the intra-field interpolation implements a new field by inserting ½divided data of two lines into region between the two lines on one field.

[0016] The line repetition can be implemented as a simple hardware, however the image quality lowers after the interpolation using the line repetition method.

[0017] In addition, the intra-field interpolation without motion-compensation also can be implemented as a simple hardware, however a picture is deteriorated due to an error occurred in the interpolation of a motion picture.

[0018] And, the intra-field interpolation is better than the line repetition in the image quality and error occurrence aspect, however the picture is deteriorated when a still picture is interpolated.

[0019] In other words, as depicted in FIG. 2A˜2C, the interpolation methods all have the image quality lowering problem after the interpolation.

[0020] Accordingly, a motion-compensation interpolation for interpolating the present picture -by using field data of the former picture and field data of a picture to be implemented is suggested.

[0021] The motion-compensation interpolation divides a picture into a plurality of blocks and finds a motion vector about the each block by using timely consecutive field data on the basis of the present field data, and interpolates the present frame picture by referring the motion vector.

[0022] An image quality can be improved by the motion-compensation interpolation, however, it is implemented as a complicated hardware.

[0023] Accordingly, in order to solve the problem of the motion-compensation interpolation, a motion adaptive interpolation for interpolating a frame in accordance with a motion by assuming degree of the motion is suggested.

[0024] The motion adaptive interpolation can be implemented as a simple hardware on the comparison with the motion-compensation interpolation, and it can improve the image quality after the interpolation.

[0025] The motion adaptive interpolation comprises a Bernard method represented in the U.S. Pat. No. 5,027,201 and a Faroundja method represented in the U.S. Pat. No. 5,159,451 etc.

[0026] As described above, the conventional line repetition can be implemented as a simple hard ware, however it lowers the image quality after the interpolation.

[0027] In addition, the conventional intra-field interpolation method can be implemented as a simple hard ware also, however it has an error occurrence problem in the interpolation of the picture having motion or image quality lowering problem due to the deterioration.

[0028] In addition, the conventional intra-field interpolation is better than the line repetition in the image quality and error occurrence aspect, however the picture is deteriorated when a still picture is interpolated.

[0029] The conventional motion adaptive interpolation can be implemented as a simple hardware on the comparison with the motion-compensation interpolation, and it can improve the image quality after the interpolation. However, a stepped noise occurs due to a simple vertical interpolation in an edge having big motion.

[0030] In addition, the conventional motion adaptive interpolation uses a plurality of field memories and have a complicated processing process, accordingly manufacture cost of an implement circuit increases.

SUMMARY OF THE INVENTION

[0031] The object of the present invention is to provide a deinterlacing apparatus and a method thereof which is capable of improving definition of a picture by performing interpolation appropriately in accordance with a motion degree and an edge direction of a field to be interpolated.

[0032] The other object of the present invention is to provide a deinterlacing apparatus and a method thereof which is capable of reducing manufacture cost of a circuit to be implemented by simplifying the circuit.

[0033] In order to achieve the above-described objects of the present invention, the deinerlacing apparatus in accordance with the present invention comprises a motion determining unit for mapping field data in a field region to be interpolated and perimeter field data around of it and detecting BD (Brightness Difference) and BPPD (Brightness Profile Pattern Difference) in order to yield motion degree of a picture, a temporal interpolator for yielding a field average value about a field picture to be interpolated by averaging a pixel value of the former field and a pixel value of the after field, a spatial interpolator for detecting an edge direction comprised in the perimeter pixel values with inputs of the pixel value of the former filed and after field about the field picture to be interpolated, detecting a direction indicating a minimum region matching error in accordance with the detected edge direction, and yielding the intra-filed interpolation value in accordance with the detected direction, and a soft switch unit for mixing the yielded intra-field interpolation value and the yielded field average value in accordance with the BD (Brightness Difference) and BPPD (Brightness Profile Pattern Difference), and outputting it to a vertical converter.

[0034] In order to achieve above-described objects, a deinterlacing method in accordance with the present invention for interpolating the present field data by yielding a correlation between pixels in a certain region including a pixel to be interpolated in M number of field data and yielding an interpolation value of the pixel to be interpolated comprises a sub-sampling process for performing a sub-sampling of perimeter pixels in a certain region centering around a pixel to be interpolated when the pixel to be interpolated does not exist on a horizontal or a vertical edge, a detecting process for detecting a varying direction of the pixel to be interpolated in the pixel region where the sub-sampling is performed, and a yielding process for yielding an interpolation value by referring the detected direction.

[0035] In order to achieve above-described objects, a deinterlacing method in accordance with the present invention for detecting a motion degree by using BD and BPPD of a picture in order to interpolate the picture by referring the motion degree comprises a pixel detecting process for detecting pixels in a certain region including a pixel to be interpolated in M number of field data corresponding to an interlaced scanning type picture, a varying direction detecting process for detecting varying direction of the pixel to be interpolated by yielding a correlation between pixels in the certain region, a yielding process for yielding a region matching error of each region after dividing observation window when the pixel to be interpolated does not exist on the horizontal or vertical edge in the certain region, and a yielding process for yielding an interpolation value to a direction indicating a minimum region matching error among the yielded errors of the each region.

BRIEF DESCRIPTION OF THE DRAWING

[0036]FIG. 1 illustrates a picture in accordance with the general interlacing method.

[0037]FIG. 2A illustrates a line repetition in accordance with the conventional technology.

[0038]FIG. 2B illustrates an intra-field interpolation without motion-compensation in accordance with the conventional technology.

[0039]FIG. 2C illustrates an intra-field interpolation in accordance with the conventional technology.

[0040]FIG. 3 is a block diagram illustrating a deinterlacing apparatus in accordance with the embodiment of the preset invention.

[0041]FIG. 4 illustrates a region division for mapping an edge portion in accordance with the embodiment of the present invention.

[0042]FIG. 5A illustrates a picture region corresponding to 3×3 size of a sobel mask for finding variation value about direction of a pixel value in accordance with the embodiment of the present invention.

[0043]FIG. 5B illustrates a sobel mask for finding y axial direction variation value of a pixel value in accordance with the embodiment of the present invention.

[0044]FIG. 5C illustrates a sobel mask for finding x axial direction variation value of a pixel value in accordance with the embodiment of the present invention.

[0045]FIG. 6 illustrates relation between an edge direction and a gradient direction in accordance with the embodiment of the present invention.

[0046]FIG. 7 illustrates a sub-sampling method for detecting optical angle edge in accordance with the embodiment of the present invention.

[0047]FIG. 8A illustrates a pixel to be interpolated and perimeter pixels in accordance with the embodiment of the present invention.

[0048]FIG. 8B illustrates a two-dimension gaussian filter for removing a noise element in accordance with the embodiment of the present invention.

[0049]FIG. 9 illustrates an edge direction detecting method on the basis of a gradient and a hierarchical rule in accordance with the embodiment of the present invention.

[0050]FIG. 10 illustrates a region matching method for detecting an interpolation direction in accordance with the embodiment of the present invention.

[0051]FIG. 11 illustrates an observation window division for a region matching method in accordance with the embodiment of the present invention.

[0052]FIG. 12 illustrates a region matching method for detecting an interpolation direction in accordance with the embodiment of the present invention.

[0053]FIG. 13 illustrates an observation window division for the region matching method in accordance with the embodiment of the present invention.

[0054]FIG. 14 illustrates pixels and field data used for a median filtering in accordance with the embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

[0055]FIG. 3 is a block diagram illustrating a deinterlacing apparatus in accordance with the embodiment of the preset invention.

[0056] As depicted in FIG. 3, the deinterlacing apparatus in accordance with the present invention comprises a field storing unit 30 for storing timely consecutive preset field data, former two sheet field data and next four sheet field data, a motion determining unit 31 for yielding BD (Brightness Difference) and BPPD (Brightness Profile Pattern Difference) in the field storing unit 30, mapping it with a preset value when the BD and BPPD are greater than a certain threshold, and yielding a motion degree value by referring the BD and BPPD, a median filter 32 for grouping a region where the motion degree value is by removing the noise element included in the motion degree value, an expander 33 for diffusing the motion degree value into the perimeter pixels with input of the filter value of the median filter 32, a spatial interpolator 34 for yielding the intra-field interpolation value in accordance with the direction by yielding an edge direction included in the pixel value around the pixel to be interpolated with the input of the pixel value of the field data in the preset interpolated region from the filter storing unit 30 and intra-field perimeter pixel value, a temporal interpolator 37 for yielding a field average value by averaging the former field pixel value and after field pixel value about the preset interpolated field picture, a soft switch 35 for mixing the intra-field interpolation value considering the edge direction of the spatial interpolator 34 and the field average value of the temporal interpolator 37 by referring the BD and BPPD on the expander 33, and a vertical converter 36 for converting number of vertical line by referring the interpolation line data on the soft switch 35 with the input of the present field data on the field storing unit 30.

[0057] The motion determining unit 31 comprises a BD/BPPD finder 31B for yielding BP and BPPD in the former filed and after filter by detecting the BD and BPPD of the each field data on the field storing unit 30 centering around the present field, and a BD/BPPD combiner 31A for determining a motion degree value by mapping with the preset value when the BD and BPPD are greater than the preset threshold value.

[0058] The operation and operation effect of the present apparatus will now be described in detail.

[0059] First, the field storing unit 30 stores picture data corresponding to timely consecutive M number of fields such as nth picture data and former filed and after field etc. centering around the preset field, namely, nth field among a plurality of field data for implementing an output picture.

[0060] In other words, the field storing unit 30 stores the former and after field data including the nth field data, and provides the stored field data to the motion determining unit 31, spatial interpolator 34, and temporal interpolator 37.

[0061] Herein, the motion determining unit 31 calculates the motion degree of the moving picture by detecting a pixel value and BPPD of a certain line existed between the each field data stored on the field storing unit 30.

[0062] In other words, the motion determining unit 31 can determine the motion degree value by the BD/BPPD finder 31B for detecting the BD and BPPD of the each field data on the field storing unit 30, comparing the BD and BPPD of the former field and after field centering around the present field and yielding the BD and BPPD, and the BD/BPPD combiner 31A for inputting the yielded BD and BPPD.

[0063] When the BD and BPPD are separately greater than the preset threshold value, the BD/BPPD combiner 31A maps the BD and BPPD with the preset value, and determines the motion degree value.

[0064] Herein, the BD concept is used in a picture processing field such as a digital television etc. in order to perform the line interpolation, the BPPD concept is represented in Korea patent No.97-80719 patented by a inventor of the present invention.

[0065] In the Korea patent 97-80719 by the inventor of the present invention, quantization of the BPPD for yielding the BD and BPPD performs the line interpolation about a certain plurality of lines in accordance with application.

[0066] For example, the yielding process for yielding the BD and BPPD on the motion determining unit 31 by assuming timely consecutive n−2, n−1, n, n+1 four field data will now be described in detail.

[0067] First, the BPPD of the n−2th field data is extracted by using the pixel value of the n−2th field data. In other words, the BPPD on the n−2th field input time is extracted.

[0068] And, the BPPD of the nth field data is extracted by using the pixel value of the nth field data. In other words, the BPPD on the nth field input time is extracted.

[0069] After that, the motion determining unit 31 yields the BPPD of the n−2th field and nth field by comparing the n−2th field BPPD and nth field BPPD. In addition, the BD of the n−2th field and nth field is yielded.

[0070] In addition, the motion determining unit 31 yields the BP and BPPD of the n−1th field and n+1 field with process same with the above-described process.

[0071] However, a noise is mixed inevitably in a picture transmitted through a broadcasting channel etc. in a coding process or a transmission process.

[0072] Accordingly, in the present invention, the motion determining unit 31 comprises the median filter 32 for removing the noise element in the output value of the BD/BPPD combiner 31A and grouping the motion detected region among the pictures, and the expander 33 for expanding the motion degree value to the other pixel adjacent to the pixel having motion with the input of the output value on the median filter 32 in order to set the output value of the BD/BPPD combiner 31A accurately.

[0073] Herein, the expander 33 expands the motion degree value to the adjacent pixel, the cause will now be described.

[0074] In general, the motion of the moving picture not only performs on a certain pixel, but also pixel groups on a certain region.

[0075] Accordingly, when the motion degree value of the certain pixel is detected, it is because the noise element of the pixel or the certain pixel and adjacent perimeter pixel are in motion state.

[0076] Herein, the motion degree value corresponding to the noise element is removed already on the median filter 32, accordingly there is high possibility the perimeter pixels are in motion state.

[0077] Accordingly, the expander 33 expands the motion degree value outputted from the median filter 32 to the perimeter of the pixel which is detected the motion degree value.

[0078] Meanwhile, the spatial interpolator 34 detects the pixel value of the nth field data corresponding to the region to be line-interpolated and the intra-field perimeter pixels with the input of the field data in the region to be interpolated from the field storing unit 30, yields an edge direction including the pixel values around the pixel to be interpolated by using the correlation of the intra-field pixels, and extracts an appropriate interpolation value in accordance with the edge direction.

[0079] In particular, the spatial interpolator 34 in accordance with the present invention extracts pixel value of the pixels spatially adjacent from the pixel to be interpolated, pixel value of the field timely adjacent for the present field of the pixel to be interpolated, interpolation value of the pixel to be interpolated by filtering in order to maintain spatial consistency and timely consistency of the pixel to be interpolated, it adapts an edge direction detecting method using a gradient and a rule and a region matching method.

[0080] Because the operation theories of the edge direction detecting method using a gradient and a rule and the region matching method are described in detail in Korea patent No.99-26084 by the inventor of the present invention, the present invention will describe it briefly.

[0081] First, the spatial interpolator 34 detects the edge direction by using the correlation of the intra-field pixels.

[0082] Herein, a whole region will now be described in detail with reference to FIG. 4 in order to detect the edge direction of the pixel to be interpolated.

[0083]FIG. 4 illustrates a region division for mapping the edge portion in accordance with the embodiment of the present invention.

[0084] As depicted in FIG. 4, it is assumed the whole region is divided into three direction such as, −45°, 0°, 45°, the spatial interpolator 34 finds the correlation about pixels adjacent upper, lower, left, right centering around the pixel to be interpolated in order to judge where the pixel to be interpolated is included among the three directions, and judges whether the pixel to be interpolated is included in a vertical or horizontal edge.

[0085] For example, when the jth pixel on the ith line is interpolated, the correlation about the vertical direction between the pixel to be interpolated and adjacent pixel can be found by a below equation. $\begin{matrix} {{{\frac{\begin{matrix} \left( {{p\left( {{i - 1},{j - 2},n} \right)} + {2{p\left( {{i - 1},{j - 1},n} \right)}} +} \right. \\ \left. {p\left( {{i - 1},j,n} \right)} \right) \end{matrix}}{4} - \frac{\begin{matrix} \left( {{p\left( {{i + 1},{j - 2},n} \right)} + {2{p\left( {{i + 1},{j - 1},n} \right)}} +} \right. \\ \left. {p\left( {{i + 1},j,n} \right)} \right) \end{matrix}}{4}}} = a} & \text{[Equation 1]} \end{matrix}$

$\begin{matrix} {{{\frac{\begin{matrix} \left( {{p\left( {{i - 1},{j - 2},n} \right)} + {2{p\left( {{i - 1},{j - 1},n} \right)}} +} \right. \\ \left. {p\left( {{i - 1},{j + 1},n} \right)} \right) \end{matrix}}{4} - \frac{\begin{matrix} \left( {{p\left( {{i + 1},{j - 1},n} \right)} + {2{p\left( {{i + 1},j,n} \right)}} +} \right. \\ \left. {p\left( {{i + 1},{j + 1},n} \right)} \right) \end{matrix}}{4}}} = b} & \text{[Equation 2]} \end{matrix}$

$\begin{matrix} {{{\frac{\begin{matrix} \left( {{p\left( {{i - 1},j,n} \right)} + {2{p\left( {{i - 1},{j + 1},n} \right)}} +} \right. \\ \left. {p\left( {{i - 1},{j + 2},n} \right)} \right) \end{matrix}}{4} - \frac{\begin{matrix} \left( {{p\left( {{i + 1},j,n} \right)} + {2{p\left( {{i + 1},{j + 1},n} \right)}} +} \right. \\ \left. {p\left( {{i + 1},{j + 2},n} \right)} \right) \end{matrix}}{4}}} = c} & \text{[Equation 3]} \end{matrix}$

[0086] After that, the spatial interpolator 34 yields the edge direction or the pixel to be interpolated by performing a process same with a below program.

[0087]  IF (max{a,b,c}<threshold)THEN

[0088]

[0089] edge direction=0°

[0090] ELSE

[0091] edge direction detection by a gradient

[0092] ENDIF

[0093] Herein, the pixel to be interpolated is p (i,j,n), it means a pixel placed on i row, j column.

[0094] The same meaning can be adapted to p(i,j,n) used in Equation 1-3.

[0095] In other words, the spatial interpolator 34 yields a maximum value (max (a, b, c)) of the difference value (a,b,c) between low-pass-filtered pixels found by the equation 1-3, and judges the edge direction of the pixel to be interpolated as 0° when the maximum value (max (a,b,c)) is smaller than a certain threshold.

[0096] In addition, the edge direction of the pixel to be interpolated is judged as 0°, when the horizontal direction correlation about the low-pass-filtered pixel is detected by the similar method with the vertical direction correlation detecting method and the yielded value is smaller than the certain threshold of the horizontal direction.

[0097] On the contrary, when the maximum value (max (a,b,c)) of the difference value between low-pass-filtered pixels is same with a certain threshold or larger, in other words, when the pixel to be interpolated exists in the region showing the low correlation to the vertical or horizontal direction, the spatial interpolator 34 detects the edge direction by using the edge direction detecting method using a gradient and a rule.

[0098] In other words, the pixel to be interpolated is not included in the vertical or horizontal edge, accordingly process for yielding the edge direction including the pixel to be interpolated will now be described with reference to accompanying drawing 5A˜5C.

[0099]FIG. 5A illustrates a picture region corresponding to 3×3 size of a sobel mask for finding variation value about direction of a pixel value in accordance with the embodiment of the present invention.

[0100] As depicted in FIG. 5A, the gradient of the pixel value is found by using the 3×3 size sobel mask.

[0101]FIG. 5B illustrates a sobel mask for finding y axial direction variation value of a pixel value in accordance with the embodiment of the present invention.

[0102] As depicted in FIG. 5B, the 3×3 size sobel mask for finding the y axial gradient on a pixel (×5) is described.

[0103]FIG. 5C illustrates a sobel mask for finding x axial direction variation value of a pixel value in accordance with the embodiment of the present invention.

[0104] As depicted in FIG. 5C, the 3×3 size sobel mask for finding the x axial gradient on a pixel (×5) is described.

[0105] Herein, the gradient of the pixel value is found by substituting the pixel value inside of the sobel mask of FIG. 5A˜C into below Equantion4, 5. $\begin{matrix} {{\overset{\rightarrow}{G}\left\lbrack P_{y,x} \right\rbrack} = {\begin{pmatrix} G_{x} \\ G_{y} \end{pmatrix} = \begin{pmatrix} \frac{\partial p}{\partial x} \\ \frac{\partial p}{\partial y} \end{pmatrix}}} & \text{[Equation 4]} \end{matrix}$

$\begin{matrix} {{\alpha \left( {y,x} \right)} = {\tan^{- 1}\left\lbrack \frac{G_{y}}{G_{x}} \right\rbrack}} & \text{[Equation 5]} \end{matrix}$

[0106] Herein, α is angle measured corresponding to a x axial.

[0107] Accordingly, direction of the gradient will now be described with reference to accompanying FIG. 6.

[0108]FIG. 6 illustrates the relation between the edge direction and gradient direction in accordance with the embodiment of the present invention.

[0109] As depicted in FIG. 6, it is vertical to the edge direction (a_(e) (y,x)), the edge direction (a_(e) (y,x)) can be found by using below Equation 6.

[0110] Equation 6

α_(e)(y,x)≧0, 90−α ( y,x)

α_(e)(y,x)<0, −90−α ( y,x)

[0111] According to this, the spatial interpolator 34 judges whether the edge direction detected by the gradient is belonged to 0°.

[0112] Herein, when the edge direction in accordance with the operation result is judged as 0°, process for judging whether the pixel to be interpolated exists on the edge of more wide range will now be described in detail with reference to accompanying FIG. 7.

[0113]FIG. 7 illustrates a sub-sampling method for detecting optical angle edge in accordance with the embodiment of the present invention.

[0114] As depicted in FIG. 7, a sobel mask is found by performing the sub-sampling about j−n˜j+n column centering around the pixel to be interpolated.

[0115] Herein, in order to prevent aliasing of frequency wide band, the sub-sampling is performed after limiting as request frequency wide band by performing the low pass filtering.

[0116] After that, the spatial interpolator 34 performs the Equation 1˜3 operation about the sobel mask, compares the maximum value (max (a, ,b c)) of the difference value (a, b, c) between the pixels with the threshold, and judges whether the pixel to be interpolated exists on the horizontal or vertical edge.

[0117] According to this, in the judging result about the sub-sampling pixel, when the pixel to be interpolated exists on the horizontal or vertical edge, the spatial interpolator 34 judges the edge direction of the pixel to be interpolated as 0°.

[0118] On the contrary, when the pixel to be interpolated does not exist on the horizontal or vertical edge, the spatial interpolator 34 yields the edge direction by performing the Equation 4˜6 operation.

[0119] And, when the edge direction is detected by the gradient, an initial assumption pixel value of a line to be interpolated is a value interpolated linearly to a vertical direction or a value adapting two dimension gaussian filter to the lineally interpolated value is used. It will now be described in detail with reference to accompanying FIG. 8A and 8B.

[0120]FIG. 8A illustrates a pixel to be interpolated and perimeter pixels in accordance with the embodiment of the present invention. In other words, it describes 3×3 picture region of Interlaced scanning field picture.

[0121]FIG. 8B illustrates a two-dimension gaussian filter for removing a noise element in accordance with the embodiment of the present invention.

[0122] As depicted in FIG. 8A and 8B, the initial assumption pixel value lineally interpolated on x in the picture region same with FIG. 8A to the vertical direction is $\frac{b + e}{2}.$

[0123] In addition, the initial assumption pixel value on x after passing the two dimension gaussian filter in FIG. 8B is $\frac{\left( {a + {2b} + c + d + {2e} + f} \right)}{8}.$

[0124] Accordingly, the spatial interpolator 34 performs the above-described process in accordance with a below program.

[0125] IF (Exist on horizontal or vertical edge) THEN

[0126] Edge direction=0°

[0127] ELSE

[0128] Detect edge direction by the gradient calculation

[0129] IF (edge direction=0°) THEN

[0130] Perform the sub-sampling centering around the present pixel to be interpolated

[0131] IF (Exist on horizontal or vertical edge) THEN

[0132] Edge direction=0°

[0133] ELSE

[0134] Detect edge direction by the gradient calculation

[0135] ENDIF

[0136] ENDIF

[0137] ENDIF

[0138] In other words, when the pixel to be interpolated exists on the horizontal or vertical edge after detecting the correlation between the pixel to be interpolated and perimeter pixels, the edge direction is judged as 0°.

[0139] Meanwhile, when the edge direction of the pixel to be interpolated is not 0°, the edge direction is yielded by adapting the edge direction detecting method using a gradient, and it is judged whether the edge direction is 0°.

[0140] Herein, when the edge direction is judged as 0°, the sub-sampling is performed centering around the pixel to be interpolated, it is judged whether the pixel to be interpolated exists on the horizontal or vertical edge by using Equation 1˜3.

[0141] According to this, when the pixel to be interpolated exists on the horizontal or vertical edge, the edge direction of the pixel to be interpolated is judged as 0° finally.

[0142] On the contrary, after the sub-sampling of the pixel, when the pixel to be interpolated does not exist on the horizontal or vertical edge, the edge direction is yielded by adapting the edge direction detecting method using the gradient about the sub-sampling pixel.

[0143] After that, Dir(j+1), Dir(j+2), Dir(j+3), dir(j+4), . . . of the direction value of the each pixel are yielded continually by performing the above-described process repeatedly about the pixel placed on j+1, j+2, j+3, j+4, . . . .

[0144] In addition, when the edge direction of the pixel to be interpolated is detected in accordance with the above-described process, the spatial interpolator 34 interpolates the initial edge direction wrongfully detected due to the noise element by using a “edge detecting method using hierarchical rule” and comparing-analyzing it with the edge directions belonging the perimeter pixels. It will now be described in more detail with reference to accompanying FIG. 9.

[0145]FIG. 9 illustrates an edge direction detecting method on the basis of a gradient and a hierarchical rule in accordance with the embodiment of the present invention.

[0146] As depicted in FIG. 9, the direction values (NewDir(j+3)) of the pixel placed adjacent to the pixel to be yielded the original direction value to the horizontal direction is assumed by performing the operation process of the first program module by referring the direction values Dir(j+1), Dir(j+2), Dir(j+3), Dir(j+4), . . . of the each pixel.

[0147] In addition, the direction value (NewDir(j+2)) of the adjacent pixel is assumed with the same method by substituting the j into j−1.

[0148] After that, the direction value (OutDir(j+2)) of the after adjacent pixel is yielded by performing the operation process of the second program module by using the yielded direction values (NewDir(j+2)), NewDir(j+3)), the pixel to be found the present direction value and the direction values (OutDir(j), OutDir(j+1)) of the former pixel.

[0149] According to this, the edge direction (FinalDir(j)) of the pixel to be interpolated is compensated to the right direction by performing an operation process of a third program module by using the direction value (Outdir(j+2)) of the adjacent pixel, the present pixel to be found the direction value, the direction values (Outdir(j−2), OutDir(j−1), OutDir(j), OutDir(j+1)) of the former and after pixels.

[0150] After that, the region matching method is adapted in order to yield an interpolation value of the pixel to be interpolated by detecting more detailed edge direction and linear-interpolating the perimeter pixel values about the edge direction (FinalDir(j)) determined macroscopic as described above.

[0151] The region matching method extracts the interpolation value by using a character the pixel value in the region to be interpolated is consecutive in accordance with the edge direction. It will now be described in detail.

[0152] First, the pixel value existed in a sliding window on a certain edge including a pixel to be interpolated is detected.

[0153] Herein, the volume of the sliding window can be adjusted in accordance with a system.

[0154] And, while the sliding windows placed up and down are shifted to the opposite direction each other with a certain interval, the difference between the pixels corresponding to each other in the up and down sliding windows is continually detected about various edge directions in the shifted interval.

[0155] At the same time, the edge direction including the pixel to be interpolated is detected by referring continually the detected variation of the pixel value. It will now be described in detail with reference to accompanying FIG. 10.

[0156]FIG. 10 illustrates the region matching method for detecting the interpolation direction in accordance with the embodiment of the present invention.

[0157] As depicted in FIG. 10, when the macroscopic edge direction (FinalDir(j)) determined by the edge direction detecting method using the gradient and hierarchical rule is −45°, the region matching method for determining the detailed direction is described.

[0158] Accordingly, a certain sliding window is set on i+1th line and i−1th line in a regular observation window centering around ith line to be interpolated.

[0159] And, the sliding window on the i−1th line is moved left to right, the sliding window on the i+1th line is moved into right to left.

[0160] And, the variation of the pixel value is yielded by detecting the difference value of the pixels placed on a diagonal line each other in the sliding windows and adding the difference or converting the added value into an average difference value per a pixel in a certain sliding window.

[0161] Herein, the sliding interval of the sliding window is set a half of the adjacent pixel interval, however it is also possible to adjust the sliding interval of the sliding window with a detailed interval such as ¼, ⅛, . . . etc. in order to get more accurate variation.

[0162] Herein, the pixel value of the pixels adjacent each other horizontally in the observation window is linearly interpolated, the linearly interpolated pixel value is set a value between the pixels horizontally adjacent each other in the observation window.

[0163] After that, the difference of the pixel values of the pixel in the sliding window is yielded by a below Equation 7 or the average difference per the pixel dividing Err_(m) of Equation 7 with the number of the pixels placed in the sliding window is yielded. $\begin{matrix} {{Err}_{m} = {\sum\limits_{n = \frac{- k}{2}}^{\frac{k}{2}}{{P_{i,{j + m + n}} - P_{{i + 2},{j + n - m}}}}}} & \text{[Equation 7]} \end{matrix}$

[0164] Herein, the m can be set to the direction of a diagonal line to be found in accordance with an application. For example, the range of m can be set from −3 to +3, and the interval of the m value between −3 and +3 can be defined by the sliding interval of the sliding window.

[0165] After that, a minimum value is extracted among the values by Equation 7, and m_(min) value about the minimum value is extracted. In other words, when the range of the m is set from −3 to +3 and the sliding interval of the sliding window is defined as a half pixel, the interpolation value is yielded in accordance with m_(min).

[0166] Hereinafter, the interpolation value yielding process by the region matching method will now described in detail.

[0167] First, the pixel value of the each pixel comprised in the movement region can be found by linearly interpolating the pixels adjacent horizontally each other.

[0168] And, the interpolated pixel value is inserted between the pixels adjacent horizontally, the difference between the pixels of the sliding regions is yielded and is added.

[0169] After that, the interpolation value is found by yielding the minimum value among the added values and linear-interpolating the pixel value existed on the center of the upper and lower sliding regions placed on the diagonal line where the minimum value is yielded.

[0170] Herein, when at least two m_(min) are yielded among the values yielded by Equation 7, the interpolation value at the most closest point has priority by setting m as a datum point when m is 0.

[0171] In addition, when two m_(min) are yielded at the point having same distance from the datum point when the m is 0, the interpolation value is yielded by filtering the pixel value placed on the center of the sliding windows where the two m_(min) exist.

[0172] And, the volume of the observation window and the number of the pixels comprised in the observation window can be adjusted freely.

[0173] Also, the volume of the sliding window can be adjusted freely in the range of the observation window, and the number of the pixels comprised in the sliding window can be adjusted freely.

[0174] However, in the present invention, when the region matching method is adapted in detail according to the given edge direction, the region matching method is adapted to each region after dividing the region into a plurality of regions.

[0175] According to this, the minimum region matching error Min_Err of the each region is found, the pixel value placed on the pixel to be interpolated is interpolated in accordance with the direction indicating the minimum region matching error among the minimum region matching errors.

[0176]FIG. 11 illustrates an observation window division for the region matching method in accordance with the embodiment of the present invention. In other words, when the macroscopic edge direction (FinalDir(j)) is 45°, the region matching method about the each region after dividing largely into A, B region is described.

[0177] First, the A region is set to a certain edge direction in 45° region detected centering around the edge direction 0°, and the B region is set from the certain edge direction to the end of the region to be observed on the 45° direction.

[0178] In addition, the certain edge direction as the set region boundary can be selected freely in consideration of an application and volume of the sliding window etc.

[0179] Herein, the region matching error is found about the each A, B region with the operation as Equation 7, the region matching errors about the each A, B region are compared, accordingly the minimum region matching error Min_Err_(A), Min_Err_(B) in the each A, B region are found.

[0180] After that, the minimum region matching error Min_Err_(A), Min_Err_(B) in the each A, B region are compared.

[0181] Herein, when the region matching error Min_Err_(A) is smaller than or same with Min_Err_(B), the resent pixel value to be interpolated is the interpolated value in accordance with the direction showing the minimum region matching error Min _Err_(A) of the A region.

[0182] On the contrary, when the region matching error Min _Err_(A) is bigger than the region matching error Min_Err_(B), the interpolated pixel value is found in accordance with the direction indicating the minimum region matching error Min _Err_(B) of the B region, and it is judged whether it exists between the pixels on the upper and lower of the pixel to be interpolated.

[0183] According to this, when there is the value interpolated in accordance with the direction indicating minimum region matching error Min_Err_(B) between the pixel values existed upper and lower of the present pixel to be interpolated, the pixel value is the pixel value to be interpolated.

[0184] Meanwhile, when there is not the pixel value interpolated in accordance with the direction indicating the minimum region matching error Min_Err_(B) between the pixel values existed upper and lower of the pixel, the pixel value to be interpolated is the value interpolated according to the direction indicating the minimum region matching error (Min_Err_(A)) of the A region.

[0185] In other words, the above-described process is performed in accordance with a below program.

IF(Min_Err_(A)≦Min_Err_(B)) THEN

P ₁(i, j, n)=P _(A1)(i, j, n)

[0186] ELSE

[0187]  IF (Median {P(i−1, j, n), P _(B1)(i, j, n), P(i+1, j, n)}=P _(B1)(i, j, n)) THEN

P ₁(i, j, n)=P _(B1)(i, j, n)

[0188] ELSE

P ₁(i, j, n)=P _(A1)(i, j, n)

[0189] ENDIF

[0190] ENDIF

[0191] Herein, the P₁ (i, j, n) describes a pixel placed on i row, j column of nth field, it is the pixel to be interpolated presently.

[0192] In addition, the P_(A1) (i,j,n) and P_(B1) (i,j,n) describes a value interpolated in accordance with the direction indicating the minimum region matching error in the A region and B region.

[0193] Accordingly, as described above, the spatial interpolator 34 performs the interpolation by using the pixels spatially adjacent to the pixel to be interpolated presently.

[0194] In addition, when the interpolation is performed by using the pixels separated far away relatively, the spatial interpolator 34 can perform more accurate and stable interpolation by interpolating with the pixels when the correlation is high after searching the correlation of the pixels adjacent to the pixel to be interpolated.

[0195] Herein, the spatial interpolator 34 uses first the direction detecting method on the basis of the gradient and rule, and uses the region matching method after in order to determine the pixel value to be interpolated.

[0196] First, the operation theory of the region matching method is simple, however it is difficult to detect the interpolation value accurately because there is lots of computing quantity for detecting one edge direction.

[0197] On the contrary, the direction detecting method based on the gradient and rule can detect the edge direction easily with simple operation, however it is difficult to detect the edge direction accurately.

[0198] Accordingly, the present invention uses the merits of the both methods, the region matching method is used when the linear interpolation value of the edge direction detected pixel is extracted, and the edge direction detecting method based on the gradient and rule is used when the edge direction comprising the pixel to be interpolated is detected.

[0199] According to this, the present invention can provide more efficient edge detecting method by reducing the computing quantity on the comparison with a case adapting only the region matching method, and can provide more accurate edge direction detecting on the comparison with a case adapting the edge direction detecting method based on the gradient and rule.

[0200] Meanwhile, when the maximum value (max (a,b,c)) of the difference value (a,b,c) between the pixels are same with or bigger than a certain threshold, the spatial interpolator 34 detects the edge direction by using the region matching method. It will now be described in more detail with reference to accompanying FIG. 12.

[0201]FIG. 12 illustrates the region matching method for detecting an interpolation direction in accordance with the embodiment of the present invention. In other words, the edge direction determining by the region matching method is described.

[0202] As depicted in FIG. 12, the observation window is set 15 pixels to the horizontal direction, and the sliding window is set 1×7 pixel region.

[0203] First, a certain sliding window is set on i+1th line and i−1th line in a certain observation window centering around the ith line to be interpolated.

[0204] After that, the sliding window of the i−1th line is moved into right, and the sliding window on the i+1th line is moved right to left.

[0205] Herein, it is assumed the sliding region is moved with ¼pixel degree.

[0206] According to this, detecting the difference value of the pixels placed on the diagonal line each other on the each sliding displacement in the sliding window, the region matching error (Err_(d)) of the pixel value is yielded by calculating the difference value as below Equation 8. $\begin{matrix} {{Err}_{d} = {\frac{1}{7}{\sum\limits_{k = {{- 3} + d}}^{3 + d}{{{P\left( {{i - 1},{j + k},n} \right)} - {P\left( {{i + 1},{j + k - {2d}},n} \right)}}}}}} & \text{[Equation 8]} \end{matrix}$

[0207] Herein, the d means the edge direction.

[0208] Accordingly, the relation between the edge direction (d) and observation window (W₀) can be described as below Equation 9, and the relation between the edge direction (d) and moving interval (Δx) can be described as below Equation 10.

[0209] In other words, when the pixel block of the sliding window slides with ¼pixel degree, the sliding interval (Δx) is ¼. $\begin{matrix} {{- \frac{\left( {W_{0} - 1} \right)}{2}} \leq d \leq \frac{\left( {W_{0} - 1} \right)}{2}} & \text{[Equation 9]} \end{matrix}$

[0210] Equation 10

d _(i+1) −d ₁ =Δx

[0211] Herein, when the range of the edge to be detected is wide, the observation window is expanded, and in order to heighten the detecting accuracy of the edge direction and interpolation accuracy, the moving degree of the pixel block in the sliding window is reduced.

[0212] In other words, the volume of the observation window and sliding window can be adjusted freely in accordance with the application. And, the number of the pixels comprised in the observation window and sliding window can be adjusted freely also.

[0213] However, in the present invention, when the region matching method is adapted in detail according to the given edge direction, the region matching method is adapted to the each region after dividing the observation window into a plurality of regions.

[0214] Herein, the region matching method is adapted to the each region by dividing the dividing the observation window into the plurality of regions.

[0215] According to this, the minimum region matching error (Min_err) of the each region is found, the pixel value of the pixel to be interpolated is interpolated in accordance with the direction indicating the minimum region matching error among the minimum matching errors. It will now be described in detail with reference to accompanying FIG. 13.

[0216]FIG. 13 illustrates the observation window division for the region matching method in accordance with the embodiment of the present invention.

[0217] As depicted in FIG. 13, when the region is divided into C, D regions, the interpolation process for interpolating the pixel value of the pixel to be interpolated will now be described in detail.

[0218] First, the C region is set to a certain degree boundary by considering the volume of the sliding window to left and right direction centering around the edge direction 0°, and the D region is set from the boundary of the C region to the end of the left and right observation window.

[0219] Herein, the region matching errors are found about the each C and D region with the Equation 8, the region matching errors about the each C, D region are compared, accordingly the minimum region matching error Min_Err_(C), Min_Err_(D) in the C, D region are found.

[0220] After that, the minimum matching error Min_Err_(C), Min_Err_(D) in the C, D region are compared.

[0221] Herein, when the region matching error Min_Err_(C) is smaller than or same with the region matching error Min_Err_(D), the pixel value to be interpolated is a value interpolated in accordance with the direction indicating Min_Err_(D) of the region matching error of the C region.

[0222] On the contrary, when the region matching error Min_Err_(C) is bigger than the region matching error Min_Err_(D), the pixel value interpolated in accordance with the direction indicating Min_Err_(D) of the region matching error of the C region is found, and it is judged whether there is the found value between the pixel values existed on upper and lower of the pixel to be interpolated.

[0223] According to this, when there is the pixel value interpolated in accordance with the direction indicating the region matching error Min_Err_(D) between the pixel values existing on the upper and lower of the pixel to be interpolated, the pixel value is the pixel value to be interpolated.

[0224] Meanwhile, when there is not the pixel value interpolated in accordance with the direction indicating the region matching error Min_Err_(D) between the pixel values existing on the upper and lower of the pixel to be interpolated, the pixel value to be interpolated is a value interpolated in accordance with the direction indicating the region matching error Min_Err_(C) of the C region.

[0225] In other words, the above-described process is performed in accordance with a below program.

[0226] IF(Min_Err_(C)≦Min_Err_(D)) THEN

P ₁(i, j, n)=P _(C1)(i, j, n)

[0227] ELSE

IF (Median{P(i−1, j, n), P _(D1)(i, j, n), P(i+1, j, n)}=P _(D1)(i, j, n)) THEN

P ₁(i, j, n)=P _(D1)(i, j, n)

[0228] ELSE

P ₁(i, j, n)=P _(C1)(i, j, n)

[0229] ENDIF

[0230] ENDIF

[0231] Herein, P₁(i, j, n) illustrates a pixel on i row and j column of the nth field, and it is the pixel to be interpolated.

[0232] And, P_(C1) (i,j,n) and P_(D1) (i,j,n) mean the value interpolated in accordance with the direction indicating the minimum region matching error of the C region and D region.

[0233] In addition, in order to find the interpolation pixel in the C, D regions, the pixel value linearly interpolated in accordance with the direction indicating the minimum region matching error can be used as described above, however a pixel value interpolated as below can be used also in order to perform more stable interpolation.

[0234] The operation can be processed by a below process.

[0235] IF (Err₀=0) THEN ${P_{Cl}\left( {i,j,n} \right)} = \frac{{P\left( {{i - 1},j,n} \right)} + {P\quad \left( {{i + 1},j,n} \right)}}{2}$

[0236] ELSE $\begin{matrix} {{P_{Cl}\left( {i,j,n} \right)} = \quad {\left( \frac{{{Min}\_ {Err}}_{C}}{{Err}_{0}} \right) \cdot \left( {\frac{{P\left( {{i - 1},j,n} \right)} + {P\left( {{i + 1},j,n} \right)}}{2} +} \right.}} \\ {\quad {\left( {1 - \frac{{Min\_}\quad {Err}_{C}}{{Err}_{0}}} \right) \cdot \left( {{Pc}\quad \__{\min}\left( {i,j,n} \right)} \right)}} \end{matrix}$

[0237] ENDIF

[0238] IF (Min_Err_(D)≦Err₀) THEN

[0239] P₁(i, j, n)=P_(C1)(i, j, n), in other words, there is no need to find P_(D1)(i, j, n).

[0240] ELSE $\begin{matrix} {{P_{Dl}\left( {i,j,n} \right)} = \quad {\left( \frac{{{Min}\_ {Err}}_{D}}{{Err}_{0}} \right) \cdot \left( {\frac{{P\left( {{i - 1},j,n} \right)} + {P\left( {{i + 1},j,n} \right)}}{2} +} \right.}} \\ {\quad {\left( {1 - \frac{{Min\_}\quad {Err}_{D}}{{Err}_{0}}} \right) \cdot \left( {{P\quad}_{D}\__{\min}\left( {i,j,n} \right)} \right)}} \end{matrix}$

[0241] ENIDF

[0242] Herein, the Err₀ means the region matching error to the vertical direction, the P_(c) _(—) _(min)(i,j,n) in the pixel value interpolated linearly in accordance with the direction indicating the minimum region matching error in the C region, the P_(D) _(—) _(min)(i,j,n) is the pixel value interpolated linearly in accordance with the direction indicating the minimum region matching error in the D region.

[0243] In other words, when the minimum matching error Err₀ value to the vertical direction is approximate value of ‘0’, the interpolation value P_(C1)(i, j, n) is found, when the region matching error Err₀ to the vertical direction is not the approximate value of ‘0’, the interpolation value P_(C1) (i, j, n) is found in accordance with the direction indicating the minimum region matching error Min_Err_(C) of the D region by giving weighting factor.

[0244] And, it is compared whether the minimum region matching error Min_Err_(D) of the D region is bigger than the region matching error Err₀ to the vertical direction.

[0245] According to this, when the minimum region matching error (Min_Err_(D)) value of the D region is bigger than the region matching error Err₀, it is P₁ (i, j, n)= P_(C1) (i, j, n), accordingly there is no need to find the interpolation value P_(D1)(i, j, n).

[0246] On the contrary, when the minimum region matching error (Min_Err_(D)) value of the D region is smaller than the region matching error Err₀, the interpolation value P_(C1)(i, j, n) is found in accordance with the direction indicating the minimum region matching error Min_Err_(D) of the D region.

[0247] Accordingly, as described above, the spatial interpolator 34 performs the interpolation by using the pixels spatially adjacent to the pixel to be interpolated as much as possible.

[0248] In addition, when the interpolation is performed by using the pixels placed relatively far away, the spatial interpolator 34 can perform more accurate and stable interpolation by using the pixels only when the correlation is high by checking the correlation between the pixels adjacent to the pixel to be interpolated.

[0249] After that, the median filtering is performed about the perimeter pixels of the pixel to be interpolated, in particular, the two pixels placed diagonal line used in the linear interpolation, pixel on the interpolated position, two pixels on the interpolated position of the former filed and after field. It will now be described with reference to accompanying FIG. 14.

[0250]FIG. 14 illustrates pixels and field data used for a median filtering in accordance with the embodiment of the present invention. In other words, it illustrates the adjacent pixels used in the temporal and spatial filtering for the interpolation pixel determine.

[0251] As described in FIG. 14, the noise element of the pixel is removed by performing the median filtering with a below Equation 11 about the adjacent pixel of the pixel to be interpolated in the present field (nth field), in particular, the two pixels 1, 2 placed diagonal line used in the linear interpolation, pixel 3 on the interpolated position, two pixels 4, 5 on the interpolated position of the former filed and after field

[0252] Equation 11 ${P_{e}^{\prime}\left( {i,j,n} \right)} = {{Median}\quad \left\{ {{P\left( {i,j,{n - 1}} \right)},{P\left( {{i - 1},{j - \delta},n} \right)},\frac{\left. {{P\left( {{i - 1},{j - \delta},n} \right)} + {P\left( {{i + 1},{j + \delta},n} \right)}} \right)}{2},{P\left( {{i + 1},{j + \delta},n} \right)},{P\left( {i,j,{n + 1}} \right)}} \right\}}$

[0253] Accordingly, the noise element can be removed by filtering the pixel to be interpolated timely and spatially by performing the median filtering such as Equation 11.

[0254] In addition, the expander 33 can have timely interpolation effect of a still portion of the picture considered as the moving picture by performing the median filtering such as Equation 11, the stability can be improved by maintaining the consistency to the time axial.

[0255] And, in order to yield the more and stable interpolation value on the present field (nth field), the median filtering such as a below Equation 12 can be performed by giving a certain weighting factor to the intra-filed interpolated pixel value in accordance with the yielded edge direction. In other words, the median filtering considering the weighting factor is performed as below Equation 12. $\begin{matrix} {{P_{e}^{\prime}\left( {i,j,n} \right)} = {{Median}\quad \left\{ {{P\left( {i,j,{n - 1}} \right)},{P\left( {{i - 1},{j - \delta},n} \right)},\frac{\left( {{P\left( {{i - 1},{j - \delta},n} \right)} + {P\left( {{i + 1},{j + \delta},n} \right)}} \right)}{2},\frac{\left( {{P\left( {{i - 1},{j - \delta},n} \right)} + {P\left( {{i + 1},{j + \delta},n} \right)}} \right)}{2},{P\left( {{i + 1},{j + \delta},n} \right)},{P\left( {i,j,{n + 1}} \right)}} \right\}}} & \text{[Equation 12]} \end{matrix}$

[0256] However, when the median filtered interpolation pixel P′_(e)(i,j,n) is determined by the pixels spatially far away from the pixel to be interpolated or it exists on the very quick motion, it can have a value largely differentiated from the other pixels adjacent to the interpolation pixel value.

[0257] In order to prevent the phenomenon, the spatial interpolator 34 performs the vertical direction median filtering by a below program by referring the pixels adjacent to the vertical direction from the pixel to be interpolated on the field.

IF(|δ|<m) THEN

P _(e)(i,j,n)=P′ _(e)(i,j,n)

[0258] ELSE

P_(e)(i,j,n)=Median{P(i−1,j,n), P′e(i,j,n),P(i+1,j,n)}

[0259] ENDIF

[0260] The operation of the above-mentioned vertical direction median will now be described in detail.

[0261] First, when the distance horizontally separated from the position of the pixel to be interpolated is smaller than a determined m value, the interpolation pixel assumed by the Equation 11 or 12 is determined as the interpolation value.

[0262] However, when the distance horizontally separated from the position of the pixel to be interpolated is not smaller than a determined m value, the interpolation value is determined as the median filtered value by referring the interpolation pixel assumed by the Equation 11 or 12 and the pixel value of the pixels vertically adjacent to the interpolation pixel.

[0263] When the assumed interpolation pixel P′_(e)(i,j,n) is determined by the intra-field pixels largely spatially separated from the position to be interpolated or exists on the very quick motion, in order to prevent the interpolation pixel value is boosted as a value largely differentiated from the adjacent intra-field pixels, the interpolation pixel performs the median filtering with the vertically adjacent intra-field pixels.

[0264] And, the temporal interpolator 37 extracts the field average value by averaging the pixel value of the former field data and pixel value of the after field data corresponding to the position same with the pixel to be interpolated.

[0265] For example, when the jth pixel on the ith line has to be interpolated in order to generate the nth field picture newly, the temporal interpolator 37 extracts the field average value by averaging the pixel value of the n−1th field data and the pixel value of the n+1th field data having the picture data of the ith pixel on the ith line.

[0266] In other words, the field average value on the temporal interpolator 37 can be yielded by a below Equation 13. $\begin{matrix} {{P_{i}\left( {i,j,n} \right)} = \frac{{P\left( {i,j,{n - 1}} \right)} + {P\left( {i,j,{n + 1}} \right)}}{2}} & \text{[Equation 13]} \end{matrix}$

[0267] Herein, the soft switch 35 is inputted the BD and BPPD yielded from the motion determining unit 31, references the motion degree value outputted from the expander 33, mixes the intra-field interpolation value considering the edge direction outputted from the spatial interpolator 34 and the field average value outputted from the temporal interpolator 37, and outputs it.

[0268] The soft switch 35 outputs the operation value as below Equation 14. $\begin{matrix} {{P\left( {i,j,n} \right)} = {{\alpha \quad {P_{e}\left( {i,j,n} \right)}} + {\left( {1 - \alpha} \right){P\left( {i,j,{n - 1}} \right)}} + \frac{P\left( {i,j,{n + 1}} \right)}{2}}} & \text{[Equation 14]} \end{matrix}$

[0269] Herein, the α means the motion degree value outputted from the expander 33, and it is a value within the range of ‘0<motion degree value<1’.

[0270] After that, the vertical converter 36 converts the number of vertical lines of the present field picture in order to generate the interpolation line corresponding to a display apparatus by referring the present field data values stored on the field storing unit 30.

[0271] On the contrary, when the deinterlaced frame data is needed without requiring the line conversion, the vertical converter 36 passes the value outputted from the field storing unit 30 and soft switch 35, and outputs it.

[0272] As described above, the deinterlacing apparatus and the method thereof in accordance with the present invention is capable of improving the image quality of the picture by performing an appropriate interpolation in accordance with the motion degree and edge direction of the field to be interpolated.

[0273] In addition, the deinterlacing apparatus and the method thereof in accordance with the present invention is capable of reducing the manufacture cost of a circuit by simplifying the circuit. 

What is claimed is:
 1. A deinterlacing apparatus, comprising: a motion determining unit for mapping field data in a field region to be interpolated and perimeter field data around of it and detecting BD (Brightness Difference) and BPPD (Brightness Profile Pattern Difference) in order to yield motion degree of a picture; a temporal interpolator for yielding a field average value about a field picture to be interpolated by averaging a pixel value of the former field and a pixel value of the after field; a spatial interpolator for detecting an edge direction comprised in the perimeter pixel values with inputs of the pixel value of the former filed and after field about the field picture to be interpolated, detecting a direction indicating a minimum region matching error in accordance with the detected edge direction, and yielding the intra-filed interpolation value in accordance with the detected direction; and a soft switch unit for mixing the yielded intra-field interpolation value and the yielded field average value in accordance with the BD (Brightness Difference) and BPPD (Brightness Profile Pattern Difference), and outputting it to a vertical converter.
 2. The deinterlacing apparatus according to claim 1 , wherein the spatial interpolator performs a sub-sampling of a certain region centering around the pixel to be interpolated when the detected edge direction does not exist on a horizontal or a vertical edge, detects an edge direction according to a gradient when the pixel to be interpolated does not exist on the horizontal or vertical edge of the region where the sub-sampling is performed, divides a certain set observation window into a large numbers centering around the detected edge direction, detects a minimum region matching error of the each region, and yields an intra-filed interpolation value according to a direction indicating the detected minimum region matching error.
 3. The deinterlacing apparatus according to claim 2 , wherein the direction indicating the detected minimum region matching error is most adjacent to 0°.
 4. A deinterlacing method for interpolating the present field data by yielding a correlation between pixels in a certain region including a pixel to be interpolated in M number of field data and yielding an interpolation value of the pixel to be interpolated, comprising: a sub-sampling process for performing a sub-sampling of perimeter pixels in a certain region centering around a pixel to be interpolated when the pixel to be interpolated does not exist on a horizontal or a vertical edge; a detecting process for detecting a varying direction of the pixel to be interpolated in the pixel region where the sub-sampling is performed; and a yielding process for yielding an interpolation value by referring the detected direction.
 5. The deinterlacing method according to claim 4 , wherein the sub-sampling process comprises: a sub-sampling step for performing a sub-sampling of a certain perimeter region centering around the pixel to be interpolated; a correlation finding step for finding a correlation between the pixel to be interpolated and the perimeter pixel; a judging step for judging whether the pixel to be interpolated exists on the vertical or horizontal edge by referring the correlation; a yielding step for yielding a gradient of the edge portion when the pixel to be interpolated does not exist on the vertical or horizontal edge; a discriminating step for discriminating the varying direction of the pixel to be interpolated by referring the yielded gradient; and a sub-sampling step for performing the sub-sampling of a certain region pixel of the upper and lower line centering around the pixel to be interpolated when the discriminated direction is 0°.
 6. The deinterlacing method according to claim 5 , wherein the yielding step for yielding the gradient performs in advance a two-dimension gaussian filtering about the value linearly interpolated to the vertical direction.
 7. The deinterlacing method according to claim 4 , wherein the sub-sampling process performs a low-pass filtering in advance in order to limit a frequency wide-band before the sub-sampling.
 8. The deinterlacing method according to claim 4 , wherein the detecting process comprises: a correlation finding step for finding a correlation between the pixel to be interpolated and perimeter pixel in the region where the sub-sampling is performed; a judging step for judging whether the pixel to be interpolated exists on the vertical or horizontal edge by referring the correlation; a judging step for judging the edge direction as 0° when the pixel to be interpolated exists on the vertical or horizontal edge; a yielding step for yielding a gradient of the edge portion when the pixel to be interpolated does not exist on the vertical or horizontal edge; and a discriminating step for discriminating the varying direction of the pixel to be interpolated by referring the gradient.
 9. The deinterlacing method according to claim 4 , wherein the yielding process for yielding the interpolation value comprises: a dividing step for dividing the region into a first and a second regions centering around the varying direction of the pixel to be interpolated detected in the pixel region where the sub-sampling is performed; and a yielding step for yielding the interpolation value in accordance with an error direction by finding an error about the varying direction of the pixel to be interpolated about the divided first and second regions.
 10. The deinterlacing method according to claim 9 , wherein the first region is set to the edge direction detected by the gradient centering around the edge direction 0°.
 11. The deinterlacing method according to claim 9 , wherein the second region is set from the detected edge direction to the end of a region to be observed.
 12. The deinterlacing method according to claim 9 , wherein the yielding step for yielding the interpolation value in accordance with the error direction comprises: a comparing step for finding a region matching error of the first and second regions and comparing it; a yielding step for yielding a linearly interpolated value to a direction indicating a minimum region matching error of the first region when the region matching error of the first region is same with or smaller than a region matching error of the second region; a comparing step for linearly-interpolating the region matching error of the first region to a direction indicating a minimum region matching error of the second region when the region matching error of the first region is larger than the region matching error of the second region, and comparing the interpolation value is between the pixel values existed on the upper and lower of the pixel to be interpolated; and a yielding step for yielding the linearly interpolated value to a direction indicating the minimum region matching error of the second region when the pixel value linearly interpolated to the direction indicating the minimum region matching error of the second region is between the pixel values existed on the upper and lower of the pixel to be interpolated.
 13. The deinterlacing method according to claim 12 , wherein the deinterlacing method further comprises a yielding step for yielding the linearly interpolated value to a direction indicating the minimum region matching error of the first region when the pixel value linearly interpolated to the direction indicating the minimum region matching error of the second region does not exist between the pixel values existing upper and lower of the pixel to be interpolated.
 14. A deinterlacing method for detecting a motion degree by using BD and BPPD of a picture in order to interpolate the picture by referring the motion degree, comprising: a pixel detecting process for detecting pixels in a certain region including a pixel to be interpolated in M number of field data corresponding to an interlaced scanning type picture; a varying direction detecting process for detecting varying direction of the pixel to be interpolated by yielding a correlation between pixels in the certain region; a yielding process for yielding a region matching error of each region after dividing observation window when the pixel to be interpolated does not exist on the horizontal or vertical edge in the certain region; and a yielding process for yielding an interpolation value to a direction indicating a minimum region matching error among the yielded errors of the each region.
 15. The deinterlacing method according to claim 14 , wherein the yielding process for yielding the region matching error comprises: a setting step for setting an observation window to left and right centering around the varying direction of the pixel as 0° and setting a sliding window; a dividing step for dividing the set observation window into a first region and a second region; a yielding step for yielding a region matching error about the divided each region; and a yielding step for yielding a minimum region matching error in the each yielded region matching error.
 16. The deinterlacing method according to claim 15 , wherein the fist and second regions are divided centering around the edge direction 0°.
 17. The deinterlacing method according to claim 16 , wherein the first region is set to a boundary comprising the sliding window to left and right centering around the edge direction 0°.
 18. The deinterlacing method according to claim 16 , wherein the second region is set from the boundary of the fist region to the left and right end of the observation window.
 19. The deinterlacing method according to claim 15 , wherein the yielding step for yielding the interpolation value comprises: a comparing step for comparing the yielded minimum region matching error of the first and second regions; a yielding step for yielding the interpolated value to the direction indicating the minimum region matching error of the first region when the minimum region matching error of the first region is same with or smaller than the minimum region matching error of the second region; a comparing step for comparing whether there is the value interpolated to the direction indicating the minimum region matching error of the second region between the pixel values existing upper and lower of the pixel to be interpolated when the minimum region matching error of the first region is bigger than the minimum region matching error of the second region; and a yielding step for yielding the interpolated value to the direction indicating the minimum region matching error of the second region when the value interpolated to the direction indicating the minimum region matching error of the second region is between the pixel values existing upper and lower of the pixel to be interpolated.
 20. The deinterlacing method according to claim 19 , wherein the deinterlacing method further comprises a yielding step for yielding the value interpolated to the direction indicating the minimum region matching error of the second region when the value interpolated to the direction indicating the minimum region matching error of the second region does not exist between the pixel values existing upper and lower of the pixel to be interpolated.
 21. The deinterlacing method according to claim 20 , wherein the process for yielding the interpolation value is performed linearly.
 22. The deinterlacing method according to claim 14 , wherein the yielding process for yielding the interpolation value comprises: a first step for comparing the region matching error of the first and second regions; a yielding step for yielding a value linearly interpolated to a direction indicating the minimum region matching error of the first region when the minimum region matching error of the first region is same with or smaller than the minimum region matching error of the second region; a comparing step for comparing whether the minimum region matching error of the second region is bigger than the region matching error to the vertical direction when the minimum region matching error of the first region is bigger than the minimum region matching error of the second region; a yielding step for yielding the value linearly interpolated to a direction indicating the minimum region matching error of the second region by considering weighting factor when the minimum region matching error of the second region is bigger than the region matching error to the vertical direction; and a yielding step for yielding a value linearly interpolated to a direction indicating the minimum region matching error of the first region when the minimum region matching error of the second region is same with or smaller than the region matching error to the vertical direction. 